Combing Euclidean buildings
نویسنده
چکیده
For an arbitrary Euclidean building we define a certain combing, which satisfies the “fellow traveller property” and admits a recursive definition. Using this combing we prove that any group acting freely, cocompactly and by order preserving automorphisms on a Euclidean building of one of the types An, Bn, Cn admits a biautomatic structure. AMS Classification numbers Primary: 20F32
منابع مشابه
A Fixed Point Theorem in Euclidean Buildings
We establish a xed point theorem for a certain type of nonexpanding maps in Euclidean buildings, which is inspired by a theorem of La aille in p-adic Hodge theory [7, Theorem 3.2].
متن کاملCurve complexes versus Tits buildings: structures and applications
Tits buildings ∆Q(G) of linear algebraic groups G defined over the field of rational numbers Q have played an important role in understanding partial compactifications of symmetric spaces and compactifications of locally symmetric spaces, cohomological properties of arithmetic subgroups and S-arithmetic subgroups of G(Q). Curve complexes C(Sg,n) of surfaces Sg,n were introduced to parametrize b...
متن کاملN ov 2 00 4 A path model for geodesics in Euclidean buildings and its applications to representation theory
In this paper we give a combinatorial characterization of projections of geodesics in Euclidean buildings to Weyl chambers. We apply these results to the representation theory of complex semisimple Lie groups and to spherical Hecke rings associated with nonarchimedean reductive Lie groups. Our main application is a generalization of the saturation theorem of Knutson and Tao for SLn to other com...
متن کاملPolygons in buildings and their refined side lengths
As in a symmetric space of noncompact type, one can associate to an oriented geodesic segment in a Euclidean building a vector valued length in the Euclidean Weyl chamber ∆euc. In addition to the metric length it contains information on the direction of the segment. We study in this paper restrictions on the ∆euc-valued side lengths of polygons in Euclidean buildings. The main result is that fo...
متن کاملLocalization for Wireless Sensor Networks with Improved Dv-Hop and Spring-Model Refinement
Wireless sensor network (WSN) is a key enabling technology for ambient intelligence, where localization of sensor nodes is a fundamental and essential issue. Aiming at localization deficiency of DV-Based algorithm which are caused by the shortest path distance substituting for Euclidean distance, combing the advantages of error inhibition of MSO (mass-spring model), in this paper we propose a D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000